Categorical foundations for randomly timed automata

Categorical foundations for randomly timed automata

The general theory of randomly timed automata is developed: starting with the practical motivation and presentation of the envisaged notion, the categorical theory of minimization, aggregation, encapsulation, interconnection and realization of such automata is worked out. All these constructions are presented universally: minimization and realization as adjunctions, aggregation as product, inte...

A Categorical Account of Bisimulation for Timed Higher Dimensional Automata

The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of real-time models of concurrency, in order to transfer general concepts of equivalences to the models. In particular, we define a category of timed higher dimensional automata (timed HDA), whose morphisms are to be thought of as simulations, and an accompanying (sub)categor...

Multi-timed Bisimulation for Distributed Timed Automata

Timed Unfoldings for Networks of Timed Automata

Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here, we design a verification algorithm for networks of timed automata with invariants. Based on the unfolding technique, our method produces a branching process as an acyclic Petri net extended with read arcs. These arc...

Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)

A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...